On Bijective Encodings of Compressed de Bruijn Terms and Tree-based Number Systems
نویسنده
چکیده
We introduce a compression mechanism for the de Bruijn representation of lambda terms. In combination with a tree-based number system, we use it for a bijective size-proportionate Gödel numbering scheme that combines into a uniform representation natural number arithmetic with generation and normalization of lambda terms.
منابع مشابه
A Size-Proportionate Bijective Encoding of Lambda Terms as Catalan Objects Endowed with Arithmetic Operations
We describe a size-proportionate bijection between lambda terms in a compressed de Bruijn notation and the Catalan family of combinatorial objects implemented as a Haskell type class, that has as instances binary trees and multiway-trees with empty leaves, as well as standard bitstring-represented natural numbers. By building on previous work that defines arithmetic operations on instances of t...
متن کاملA Logic Programming Playground for Lambda Terms, Combinators, Types and Tree-based Arithmetic Computations
With sound unification, Definite Clause Grammars and compact expression of combinatorial generation algorithms, logic programming is shown to conveniently host a declarative playground where interesting properties and behaviors emerge from the interaction of heterogenous but deeply connected computational objects. Compact combinatorial generation algorithms are given for several families of lam...
متن کاملRanking/Unranking of Lambda Terms with Compressed de Bruijn Indices
We introduce a compressed de Bruijn representation of lambda terms and define its bijections to standard representations. Our compressed terms facilitate derivation of size-proportionate ranking and unranking algorithms of lambda terms and their inferred simple types. We specify our algorithms as a literate Prolog program.
متن کاملA representation of a compressed de Bruijn graph for pan-genome analysis that enables search
Recently, Marcus et al. (Bioinformatics 2014) proposed to use a compressed de Bruijn graph to describe the relationship between the genomes of many individuals/strains of the same or closely related species. They devised an O(n log g) time algorithm called splitMEM that constructs this graph directly (i.e., without using the uncompressed de Bruijn graph) based on a suffix tree, where n is the t...
متن کاملBijective Size-proportionate Gödel Numberings for Term Algebras
We introduce Gödel numbering algorithms that encode/decode elements of term algebras with infinite and finite signatures as unique natural numbers. In contrast with Gödel’s original encoding and various alternatives in the literature, our encodings are bijective and ensure that natural numbers always decode to syntactically valid terms. At the same time, our algorithms work in low polynomial ti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015